The bandwidth theorem for locally dense graphs
نویسندگان
چکیده
منابع مشابه
Bandwidth theorem for random graphs
A graph G is said to have bandwidth at most b, if there exists a labeling of the vertices by 1, 2, . . . , n, so that |i − j| ≤ b whenever {i, j} is an edge of G. Recently, Böttcher, Schacht, and Taraz verified a conjecture of Bollobás and Komlós which says that for every positive r,∆, γ, there exists β such that if H is an n-vertex r-chromatic graph with maximum degree at most ∆ which has band...
متن کاملOn the bandwidth of Mobius graphs
Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.
متن کاملAn Approximation Algorithm for the Bandwidth Problem on Dense Graphs
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the maximum di erence between two numbers of adjacent vertices is minimal The problem is known to be NP complete Pa and there are only few algorithms for rather special cases of the problem HMM Kr Sa Sm In this paper we present a randomized approximation algorithm for the bandwidth problem restricted to ...
متن کاملA Brooks-type Theorem for the Bandwidth of Interval Graphs
Let G be an interval graph. The layout that arranges the intervals in order by right endpoint easily shows that the bandwidth of G is at most its maximum degree ∆. Hence, if G contains a clique of size ∆ + 1, then its bandwidth must be ∆. In this paper we prove a Brooks-type bound on the bandwidth of interval graphs. Namely, the bandwidth of an interval graph is at most ∆, with equality if and ...
متن کاملNP-Hardness of the Bandwidth Problem on Dense Graphs
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the maximum diierence between the numbers of adjacent vertices is minimal. The problem has a long and varied history and is known to be NP-hard Papadimitriou Pa 76]. Recently for dense graphs a constant ratio approximation algorithm for this problem has been constructed in Karpinski, Wirtgen and Ze-likov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Forum of Mathematics, Sigma
سال: 2020
ISSN: 2050-5094
DOI: 10.1017/fms.2020.39